Modal Logic of Partitions
نویسنده
چکیده
This thesis proposes “partitionistic elimination” in philosophical applications of modal logic based on possible world semantics to notions around information and to deontic reasoning. There are two common ideas in usages of possible worlds in philosophical logic relevant to information and agency. First, elimination of possibilities represents a condition of information acquisition and real choice. It has been usually unspecified how many possibilities are to be eliminated. Second, a partition of a set of possible worlds often represents epistemic options or choices toward an action. The thesis proposes to combine these ideas: use a partition in order to specify how many possible worlds are to be eliminated when information acquisition or action arises. Based on the proposal, the thesis develops semantics of a modal language whose logic is non-monotonic in general. An axiomatization of the basic logic of the semantics is shown. Completeness and finite model properties are proved. The thesis also characterizes some frame conditions, but a nested partition condition is not characterizable. The formal results are applied to the two areas of information and obligation. The first application of new modal logics is to the logic of questions and answers. Modal operators formally describe logical behavior of relevant informal concepts previously argued. A formal counterpart of the notion of complete and just complete information behaves to elucidate some examples related to Gricean conversational implicature. The notion of partial information is to be refined to three subclasses with different logical properties. The second application of partition
منابع مشابه
Suhrawardi's Modal Syllogisms
Suhrawardi’s logic of the Hikmat al-Ishraq is basically modal. So to understand his modal logic one first has to know the non-modal part upon which his modal logic is built. In my previous paper ‘Suhrawardi on Syllogisms’(3) I discussed the former in detail. The present paper is an exposition of his treatment of modal syllogisms. On the basis of some reasonable existential presuppositi...
متن کاملDecidability and Complexity of Definability within the Class of All Partitions
This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
متن کاملOn Minimum k-Modal Partitions of Permutations
Partitioning a permutation into a minimum number of monotone subsequences is NP-hard. We extend this complexity result to minimum partitioning into k-modal subsequences; here unimodal is the special case k = 1. Based on a network flow interpretation we formulate both, the monotone and the k-modal version, as mixed integer programs. This is the first proposal to obtain provably optimal partition...
متن کاملRepresentability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers ∀p and ∃p, which, in the standard interpretation, are construed as ranging over sets of possible worlds (propositions). Most second-order systems of modal logic are highly intractable; for instance, when augmented with propositional quantifiers, K, B, T, K4 and S4 all become effectively equivalent to full second-or...
متن کاملModal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005